/*
Exponentiation
Time Limit: 500MS		Memory Limit: 10000K

Description
Problems involving the computation of exact values of very large magnitude and precision are common. 
For example, the computation of the national debt is a taxing experience for many computer systems. 

This problem requires that you write a program to compute the exact value of Rn 
where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.

Input

The input will consist of a set of pairs of values for R and n.
The R value will occupy columns 1 through 6, and the n value will be in columns 8 and 9.

Output
The output will consist of one line for each line of input giving the exact value of R^n. Leading zeros should be suppressed in the output. Insignificant trailing zeros must not be printed. Don't print the decimal point if the result is an integer.
Sample Input

95.123 12
0.4321 20
5.1234 15
6.7592  9
98.999 10
1.0100 12
Sample Output

548815620517731830194541.899025343415715973535967221869852721
.00000005148554641076956121994511276767154838481760200726351203835429763013462401
43992025569.928573701266488041146654993318703707511666295476720493953024
29448126.764121021618164430206909037173276672
90429072743629540498.107596019456651774561044010001
1.126825030131969720661201

*/


#include <string.h>
#include <iostream>


using namespace::std;


#define MAX_POSTIVE_CNT         3
#define MAX_NEGATIVE_CNT        6

#define MAX_EXPONENTIATION_NUM  25

#define MAX_RET_POSTIVE_CNT		MAX_POSTIVE_CNT*MAX_EXPONENTIATION_NUM
#define MAX_RET_NEGATIVE_CNT	MAX_NEGATIVE_CNT*MAX_EXPONENTIATION_NUM
#define NUM_DOT_CNT				1
#define NUM_DOT_INDEX			MAX_RET_POSTIVE_CNT
#define MAX_RET_LEN				(MAX_RET_POSTIVE_CNT+NUM_DOT_CNT+MAX_NEGATIVE_CNT)

static void fill_result_string(char *ret, char *last_value)
{
	while (!*last_value) {
		++last_value;
	}

	while (*last_value) {
		*ret++ = *last_value++;
	}
	*ret = '\0';
}

static inline void big_num_exponentiation(string &big_num, int n, string &result)
{
    static char immediate_value[MAX_EXPONENTIATION_NUM][MAX_RET_LEN];
    static char last_value[MAX_RET_LEN];
    int positive_num_cnt;
    int negative_num_cnt;
    size_t dot_pos = big_num.find('.');

	bool contain_dot = (string::npos != dot_pos);
    if (contain_dot) {
    	positive_num_cnt = dot_pos;
    	negative_num_cnt = big_num.length()-dot_pos;
    }
    else {
    	positive_num_cnt = big_num.length();
    	negative_num_cnt = 0;
    }

    memset(immediate_value, 0, sizeof(immediate_value));
    memset(last_value, 0, sizeof(last_value));

	/* init the first number */
    const char *real_num = big_num.c_str();
    if ('0' == real_num[0]) {
    	immediate_value[0][NUM_DOT_INDEX-1] = '0';
    	immediate_value[0][NUM_DOT_INDEX] = '.';
    	memcpy(&immediate_value[0][NUM_DOT_INDEX+1], real_num, big_num.length());
    }
    else {
    	memcpy(&immediate_value[0][NUM_DOT_INDEX-positive_num_cnt],
    		   real_num,
    		   positive_num_cnt);
		if (contain_dot) {			
			immediate_value[0][NUM_DOT_INDEX] = '.';
			memcpy(&immediate_value[0][NUM_DOT_INDEX+1],
				   real_num+positive_num_cnt+1,
				   negative_num_cnt);
		}
    }

	/* start the multiple */
    for (int i = 1; i < n; ++i) {
    	int j;
		for (j = big_num.length()-1; j >=0; --j) {
		}
    }

	positive_num_cnt *= n;
	negative_num_cnt *= n;
	
	/* summarize the result */
	int max_index = MAX_RET_LEN-1;
	if (contain_dot) {
		max_index = NUM_DOT_INDEX+negative_num_cnt;
	}
	else {
		max_index = NUM_DOT_INDEX-1;
	}
	int min_index = NUM_DOT_INDEX-positive_num_cnt;
	if (0 == positive_num_cnt) {
		--min_index;
	}

	int carry_value = 0;	
	for (int i = max_index; i >= min_index; --i) {
		int sum = 0;
		if (NUM_DOT_INDEX == i) {
			last_value[i] = '.';
		}
		for (int j = 0; j < n; ++j) {
			sum += immediate_value[j][i]-'0';
		}
		sum += carry_value;
		carry_value = sum/10;
		sum = sum%10;
		last_value[i] += sum;
		carry_value += last_value[i]/10;
		last_value[i] = last_value[i]%10+'0';
		last_value[i-1] = carry_value;
	}

	static char result_str[MAX_RET_LEN];
	fill_result_string(result_str, last_value);

	result = string(result_str);
}


int main(int argc, char* argv[])
{
    string big_num;
    int n;
    string result;

    while (cin >>big_num>>n) {
    	big_num_exponentiation(big_num, n, result);
    	cout<<result<<endl;
    }

    return 0;
}
